Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract)
نویسندگان
چکیده
In this extended abstract, we discuss the use of iteratively-supported formulas (ISFs) as a basis for computing strongly-supported models for Kleene Answer Set Programs (ASP ). ASP programs have a syntax identical to classical ASP programs. The semantics of ASP programs is based on the use of Kleene three-valued logic and strongly-supported models. For normal ASP programs, their strongly supported models are identical to classical answer sets using stable model semantics. For disjunctive ASP programs, the semantics weakens the minimality assumption resulting in a classical interpretation for disjunction. We use ISFs to characterize strongly-supported models and show that they are polynomially bounded.
منابع مشابه
Stability, Supportedness, Minimality and Kleene Answer Set Programs
Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of...
متن کاملWell-Supported Semantics for Description Logic Programs
[Fages, 1994] introduces the notion of wellsupportedness as a key requirement for the semantics of normal logic programs and characterizes the standard answer set semantics in terms of the well-supportedness condition. With the property of well-supportedness, answer sets are guaranteed to be free of circular justifications. In this paper, we extend Fages’ work to description logic programs (or ...
متن کاملAnswer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms
In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These approaches generalize the fixpoint-based and the level mapping based answer set semantics of normal logic programs to the case of logic programs with arbitrary types of c-atoms. The results are four different answer set definitions wh...
متن کاملLevel Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Level mapping and loop formulas are two different means to justify and characterize answer sets for normal logic programs. Both of them specify conditions under which a supported model is an answer set. Though serving a similar purpose, in the past the two have been studied largely in isolation with each other. In this paper, we study level mapping and loop formulas for weight constraint and ag...
متن کاملWell-Supported Semantics for Logic Programs with Generalized Rules
Logic programming under the stable model semantics has been extended to arbitrary formulas. A question of interest is how to characterize the property of well-supportedness, in the sense of Fages, which has been considered a cornerstone in answer set programming. In this paper, we address this issue by considering general logic programs, which consist of disjunctive rules with arbitrary proposi...
متن کامل